An Improved Algorithm for Discrete $l_1 $ Linear Approximation
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملAn improved approximation algorithm for requirement cut
This note presents improved approximation guarantees for the requirement cut problem: given an n-vertex edge-weighted graph G = (V , E), and g groups of vertices X1, . . . , Xg ⊆ V with each group Xi having a requirement ri between 0 and |Xi|, the goal is to find aminimum cost set of edges whose removal separates each group Xi into at least ri disconnected components. We give a tightΘ(log g) ap...
متن کاملDiscrete linear Chebyshev approximation
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملAn ADMM Algorithm for Solving l_1 Regularized MPC
We present an Alternating Direction Method of Multipliers (ADMM) algorithm for solving optimization problems with an `1 regularized least-squares cost function subject to recursive equality constraints. The considered optimization problem has applications in control, for example in `1 regularized MPC. The ADMM algorithm is easy to implement, converges fast to a solution of moderate accuracy, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1973
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0710069